Research Note - The Traveling Salesman Goes Shopping: The Systematic Deviations of Grocery Paths from TSP Optimality

نویسندگان

  • Sam K. Hui
  • Peter S. Fader
  • Eric T. Bradlow
چکیده

We examine grocery shopping paths through the lens of the “Traveling Salesman Problem” (TSP), a classic paradigm from the field of operations research. We define the “TSP-optimal” path for each shopper as the shortest path that connects all of his purchases, and we study the systematic deviations seen in his actual behavior. We decompose the length of each observed path into three components: the length of the TSP-optimal path, the additional distance due to order deviation (i.e., not following the TSP-optimal order of category purchases), and the additional distance due to travel deviation (i.e., not following the shortest point-to-point paths). We then explore the relationship between these deviations and purchase behavior. Among other things, our results show a strong relationship between order deviation and basket size, but no association between travel deviation and basket size. Finally, we look at the implications of relaxing three of the rigid assumptions of the TSP by allowing for: (1) varying degrees of “forward-lookingness” across shoppers based on their observed order of purchases, (2) the possibility of unplanned purchases, and (3) the possibility of planned category visits but no resulting purchases.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Traveling Salesman Goes Shopping: The Systematic Deviations of Grocery Paths from TSP-Optimality

We examine grocery shopping paths using the “Traveling Salesman Problem” (TSP) as a normative frame of reference. We define the “TSP-path” for each shopper as the shortest path that connects all of his purchases. We then decompose the length of each observed path into three components: the length of the TSP-path, the additional distance due to order deviation (i.e., not following the TSP-order ...

متن کامل

Solving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

متن کامل

Solving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

متن کامل

New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)

Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...

متن کامل

A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Marketing Science

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2009